Maximal Completion
نویسندگان
چکیده
Given an equational system, completion procedures compute an equivalent and complete (terminating and confluent) term rewrite system. We present a very simple and efficient completion procedure, which is based on MaxSAT solving. Experiments show that the procedure is comparable to recent powerful completion tools. 1998 ACM Subject Classification F.4.2 Grammars and Other Rewriting Systems
منابع مشابه
Optimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملThe completion of partial Latin squares
In recent times there has been some interest in studying partial latin squares which have no completions or precisely one completion, and which are critical with respect to this property. Such squares are called, respectively, premature partial latin squares and critical sets. There has also been interest in related maximal partial latin squares. This paper will explore the connection between t...
متن کاملCOMPLETIONS OF UFDs WITH SEMI-LOCAL FORMAL FIBERS
Let T M be a complete local ring such that T/M = T . Given a finite set of incomparable nonmaximal prime ideals C of T , we provide necessary and sufficient conditions for T to be the completion of a local UFD A, whose generic formal fiber is semilocal with maximal ideals the elements of C. We also show that, given the T above, we can find necessary and sufficient conditions for T to be the com...
متن کاملOn Semantic Constraints in Distributed Systems, Part II: Equivalence-Completions and Their Hierarchies
The notion of completion has been proposed by Francez et al. (1992) to transform a nonequivalence-robust fairness notion to an equivalence-robust one while maintaining several properties of the source. However, a completion may not preserve strong feasibility|a necessary and su cient condition for a completion to be implementable. In this paper, we study the system requirement for a completion ...
متن کامل